Dynamics of Boolean networks: an exact solution.
نویسندگان
چکیده
The dynamics of Boolean networks (BN) with quenched disorder and thermal noise is studied via the generating functional method. A general formulation, suitable for BN with any distribution of Boolean functions, is developed. It provides exact solutions and insight into the evolution of order parameters and properties of the stationary states, which are inaccessible via existing methodology. We identify cases where the commonly used annealed approximation is valid and others where it breaks down. Broader links between BN and general Boolean formulas are highlighted.
منابع مشابه
Phase transitions and memory effects in the dynamics of Boolean networks
Abstract The generating functional method is employed to investigate the synchronous dynamics of Boolean networks, providing an exact result for the system dynamics via a set of macroscopic order parameters. The topology of the networks studied and its constituent Boolean functions represent the system’s quenched disorder and are sampled from a given distribution. The framework accommodates a v...
متن کاملThe Dynamics of Conjunctive and Disjunctive Boolean Networks
The relationship between the properties of a dynamical system and the structure of its defining equations has long been studied in many contexts. Here we study this problem for the class of conjunctive (resp. disjunctive) Boolean networks, that is, Boolean networks in which all Boolean functions are constructed with the AND (resp. OR) operator only. The main results of this paper describe netwo...
متن کاملCombinatorics of Boolean automata circuits dynamics
In line with fields of theoretical computer science and biology that study Boolean automata networks to model regulation networks, we present some results concerning the dynamics of networks whose underlying structures are oriented cycles, that is, Boolean automata circuits. In the context of biological regulation, former studies have highlighted the importance of circuits on the asymptotic dyn...
متن کاملVanishing Configurations in Network Dynamics with Asynchronous Updates
We consider Boolean dynamics for biological networks where stochasticity is introduced through asynchronous updates. An exact method is given for finding states which can reach a steady state with positive probability, and a method is given for finding states which cannot reach other steady states. The methods are based on computational commutative algebra. The algorithms are applied to dynamic...
متن کاملSteady-state solution of probabilistic gene regulatory networks.
We introduce a probability model for gene regulatory networks, based on a system of Chapman-Kolmogorov equations that represent the dynamics of the concentration levels of each agent in the network. This unifying approach includes the representation of excitatory and inhibitory interactions between agents, second-order interactions which allow any two agents to jointly act on other agents, and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Physical review letters
دوره 106 21 شماره
صفحات -
تاریخ انتشار 2011